Bit loading and precoding for MIMO communication systems
نویسنده
چکیده
This thesis considers the joint design of bit loading, precoding and receive filters for a multiple-input multiple-output (MIMO) digital communication system. Both the transmitter and the receiver are assumed to know the channel matrix perfectly. It is well known that, for linear MIMO transceivers, orthogonal transmission (i.e., diagonalization of the channel matrix) is optimal for some criteria such as maximum mutual information. It has been shown that if the receiver uses the linear minimum mean squared error (MMSE) detector, the optimal transmission strategy is to perform bit loading on orthogonal subchannels. In the first part of the thesis, we consider the problem of designing the transceiver in order to minimize the probability of error given maximum likelihood (ML) detection. A joint bit loading and linear precoder design is proposed that outperforms the optimal orthogonal transmission. The design uses lattice invariant operations to transform the channel matrix into a lattice generator matrix with large minimum distance separation at a low price in terms of transmit power. With appropriate approximations, it is shown that this corresponds to selecting lattices with good sphere-packing properties. An algorithm for this power minimization is presented along with a lower bound on the optimization. Apparently, given the optimal ML detector, orthogonal subchannels are (in general) suboptimal. The ML detector may suffer from high computational complexity, which motivates the use of the suboptimal but less complex MMSE detector. An intermediate detector in terms of complexity and performance is the decision feedback (DF) detector. In the second part of the thesis, we consider the problem of joint bit loading and precoding assuming the DF detector. The main result shows that for a DF MIMO transceiver where the bit loading is jointly optimized with the transceiver filters, orthogonal transmission is optimal. As a consequence, inter-symbol interference is eliminated and the DF part of the receiver is actually not required, only the linear part is needed. The proof is based on a relaxation of the discrete set of available bit rates on the individual subchannels to the set of positive real numbers. In practice, the signal constellations are discrete and the optimal relaxed bit loading has to be rounded. It is shown that the loss due to rounding is small, and an upper bound on the maximum loss is derived. Numerical results are presented that confirm the theoretical results and demonstrate that orthogonal transmission and the truly optimal DF design perform almost equally well. An algorithm that
منابع مشابه
Spatial multiplexing over Rician fading channels: Linear precoding transmission strategies
Using information about the channel at the transmitter can improve the performance of multi-input multi-output (MIMO) communication systems. When perfect channel state information (CSI) is available, data can be multiplexed and optimized over independent spatial channels. However, when the available channel information is imperfect or partial, crosstalk between the spatial channels is inevitabl...
متن کاملNovel Efficient Precoding Techniques for Multiuser MIMO Systems
In Multiuser MIMO (MU-MIMO) systems, precoding is essential to eliminate or minimize the multiuser interference (MUI). However, the design of a suitable precoding algorithm with good overall performance and low computational complexity at the same time is quite challenging, especially with the increase of system dimensions. In this thesis, we explore the art of novel low-complexity high-perform...
متن کاملMse-optimal 1-bit Precoding for Multiuser Mimo via Branch and Bound
In this paper, we solve the sum mean-squared error (MSE)optimal 1-bit quantized precoding problem exactly for smallto-moderate sized multiuser multiple-input multiple-output (MU-MIMO) systems via branch and bound. To this end, we reformulate the original NP-hard precoding problem as a tree search and deploy a number of strategies that improve the pruning efficiency without sacrificing optimalit...
متن کاملJoint source and relay optimization for parallel MIMO relay networks
In this article, we study the optimal structure of the source precoding matrix and the relay amplifying matrices for multiple-input multiple-output (MIMO) relay communication systems with parallel relay nodes. Two types of receivers are considered at the destination node: (1) The linear minimal mean-squared error (MMSE) receiver; (2) The nonlinear decision feedback equalizer based on the minima...
متن کاملMIMO-OFDM Precoding Technique for Minimizing BER Upper Bound of MLD
This paper proposes a new MIMO-OFDM precoding technique that aims to minimize a bit error rate (BER) upper bound of the maximum likelihood detection (MLD) in mobile radio communications. Using a steepest descent algorithm, the proposed method estimates linear precoding matrices that can minimize the upper bound of BER under power constraints. Since the upper bound is derived from all the pairwi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009